n = int(input())
a_suc = 0
a_fai = 0
b_suc = 0
b_fai = 0
for i in range(n):
s = list(map(int, input().split()))
if s[0] == 1:
a_suc+=s[1]
a_fai+=s[2]
else:
b_suc+=s[1]
b_fai+=s[2]
if a_suc>=a_fai:
print("LIVE")
else:
print("DEAD")
if b_suc>=b_fai:
print("LIVE")
else:
print("DEAD") #include <iostream>
void solve()
{
int n;
std::cin >> n;
int ar = 0;
int al = 0;
int br = 0;
int bl = 0;
while(n--)
{
int t, x, y;
std::cin >> t >> x >> y;
if(t == 1)
{
ar += x;
al += y;
}
else
{
br += x;
bl += y;
}
}
std::cout << (ar >= al ? "LIVE" : "DEAD") << '\n';
std::cout << (br >= bl ? "LIVE" : "DEAD") << '\n';
}
int main()
{
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
std::cout.tie(nullptr);
solve();
return EXIT_SUCCESS;
}1920. Build Array from Permutation | 494. Target Sum |
797. All Paths From Source to Target | 1547B - Alphabetical Strings |
1550A - Find The Array | 118B - Present from Lena |
27A - Next Test | 785. Is Graph Bipartite |
90. Subsets II | 1560A - Dislike of Threes |
36. Valid Sudoku | 557. Reverse Words in a String III |
566. Reshape the Matrix | 167. Two Sum II - Input array is sorted |
387. First Unique Character in a String | 383. Ransom Note |
242. Valid Anagram | 141. Linked List Cycle |
21. Merge Two Sorted Lists | 203. Remove Linked List Elements |
733. Flood Fill | 206. Reverse Linked List |
83. Remove Duplicates from Sorted List | 116. Populating Next Right Pointers in Each Node |
145. Binary Tree Postorder Traversal | 94. Binary Tree Inorder Traversal |
101. Symmetric Tree | 77. Combinations |
46. Permutations | 226. Invert Binary Tree |